Augmenting Complex Problem Solving with Hybrid Compute Units
نویسندگان
چکیده
Combining software-based and human-based services is crucial for several complex problems that cannot be solved using software-based services alone. In this paper, we present novel methods for modeling and developing hybrid compute units of software-based and human-based services. We discuss high-level programming elements for different types of softwareand humanbased service units and their relationships. In particular, we focus on novel programming elements reflecting hybridity, collectiveness and adaptiveness properties, such as elasticity and social connection dependencies, and on-demand and pay-per-use economic properties, such as cost, quality and benefits, for complex problem solving. Based on these programming elements, we present programming constructs and patterns for building complex applications using hybrid services.
منابع مشابه
The Effects of Electricity Boiler on Integrated CCHP-Thermal-Heat Only Unit Commitment Problem Based on Hybrid GA Approach
Combined cooling, heat, and power (CCHP) units can be integrated with conventional separate cooling, heat, and power production units to meet demands. The goal of this study is to develop and examine a hybrid GA-heuristic optimization algorithm for solving the unit commitment problem for integrated CCHP-thermal-heat only system with considerations for electricity boiler. When environmental emis...
متن کاملSmart Grid Unit Commitment with Considerations for Pumped Storage Units Using Hybrid GA-Heuristic Optimization Algorithm
A host of technologies has been developed to achieve these aims of the smart grid. Some of these technologies include plug-in electric vehicle, demand response program, energy storage system and renewable distributed generation. However, the integration of the smart grid technologies in the power system operation studies such as economic emission unit commitment problem causes two major challen...
متن کاملA Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملSolving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm
A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...
متن کاملَA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کامل